Constructions of Orbit Codes Based on Unitary Spaces Over Finite Fields
نویسندگان
چکیده
منابع مشابه
Constructions of Subsystem Codes over Finite Fields
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dim...
متن کاملStructures and Constructions of Subsystem Codes over Finite Fields
Quantum information processing is a rapidlymounting field that promises to accelerate the speed up ofcomputations. The field utilizes the novel fundamental rules ofquantum mechanics such as accelerations. Quantum states carry-ing quantum information are tempted to noise and decoherence,that’s why the field of quantum error control comes. In thispaper, we investigate vari...
متن کاملConstructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
متن کاملOn the Generation of Dual Polar Spaces of Unitary Type Over Finite Fields
We assume the reader is familiar with the basic definitions relating to graphs and point–line geometries (as a standard reference see [1]) and in particular, the distance function, a geodesic path, and diameter of a graph; the collinearity graph of a point–line geometry 0 = (P, L), a subspace of 0, the subspace 〈X〉0 generated by a subset X of P , and convex subspace of 0. We define the generati...
متن کاملConstacyclic codes over finite fields
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3054377